Information distance and conditional complexities
نویسندگان
چکیده
منابع مشابه
Plain stopping time and conditional complexities revisited
In this paper we analyze the notion of “stopping time complexity”, the amount of information needed to specify when to stop while reading an infinite sequence. This notion was introduced by Vovk and Pavlovic [8]. It turns out that plain stopping time complexity of a binary string x could be equivalently defined as (a) the minimal plain complexity of a Turing machine that stops after reading x o...
متن کاملThe complexities and evolution of the concepts of information and information behavior
Background and Aim: This paper reviews the two major concepts in the field of information behavior (IB), namely "information" and "information seeking." Method: Adocumentary research method and review of the literature were used. Results: The word information is the smallest particle and the most essential element in the area of information behavior. The second one is the phrase "information be...
متن کاملRelations between Renyi Distance and Fisher Information
In this paper, we first show that Renyi distance between any member of a parametric family and its perturbations, is proportional to its Fisher information. We, then, prove some relations between the Renyi distance of two distributions and the Fisher information of their exponentially twisted family of densities. Finally, we show that the partial ordering of families induced by Renyi dis...
متن کاملConditional Distance Variance and Correlation
Recently a new dependence measure, the distance correlation, has been proposed to measure the dependence between continuous random variables. A nice property of this measure is that it can be consistently estimated with the empirical average of the products of certain distances between the sample points. Here we generalize this quantity to measure the conditional dependence between random varia...
متن کاملDirected Information and Conditional Mutual Information
We study directed information in Bayesian networks and related structures. Mutual information is split into directed information and residual information. Some basic equations for directed information and residual information are determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00037-8